Involutive Uninorm Logic with Fixed Point enjoys finite strong standard completeness
نویسندگان
چکیده
Abstract An algebraic proof is presented for the finite strong standard completeness of Involutive Uninorm Logic with Fixed Point ( $${{\mathbf {IUL}}^{fp}}$$ IUL fp ). It may provide a first step towards settling problem $${\mathbf {IUL}}$$ , posed in G. Metcalfe, F. Montagna. (J Symb Log 72:834–864, 2007)) an manner. The result proved via embedding theorem which based on structural description class odd involutive FL $$_e$$ e -chains have finitely many positive idempotent elements.
منابع مشابه
Justification logic enjoys the strong finite model property
We observe that justification logic enjoys a form the strong finite model property (sometimes also called small model property). Thus we obtain decidability proofs for justification logic that do not rely on Post’s theorem.
متن کاملAbout Strong Standard Completeness of Product Logic
Propositional Product Logic is known to be standard finite-strong complete but not a strong complete, that is, it is complete for deductions only from finite sets of premises with respect to evaluations on the standard product chain over the real unit interval. On the other hand, Montagna has defined a logical system, an axiomatic extension of the Hájek’s Basic Fuzzy Logic BL with an storage op...
متن کاملOn strong standard completeness of MTLQ∗ expansions
Within the mathematical logic field, much effort has been devoted to prove completeness of different axiomatizations with respect to classes of algebras defined on the real unit interval [0, 1] (see for instance [1] and [2]), but in general, what has been mainly achieved are axiomatizations and results concerning fini-tary completeness, that is, for deductions from a finite number of premises. ...
متن کاملStrong non-standard completeness for fuzzy logics
In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ultraproduct. Roughly speaking, to say that a logic C is strong non-standard complete means that, for any countable theory Γ over C and any formula φ such that Γ 6`C φ, there exists an evaluation e of C-formulas into a C...
متن کاملFixed-Point Logic with the Approximation Modality and Its Kripke Completeness
We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and their speci cations. The systems are based on the simple and the F-semantics of types, respectively, and correspond to the same modal logic, which is considered the intuitionistic version of the logic of provability. We also show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2022
ISSN: ['1432-0665', '0933-5846']
DOI: https://doi.org/10.1007/s00153-022-00839-1